Services within a Busy Period of an M/M/1 Queue and Dyck Paths
نویسندگان
چکیده
We analyze the service times of customers in a stable M/M/1 queue in equilibrium depending on their position in a busy period. We give the law of the service of a customer at the beginning, at the end, or in the middle of the busy period. It enables as a by-product to prove that the process of instants of beginning of services is not Poisson. We then proceed to a more precise analysis. We consider a family of polynomial generating series associated with Dyck paths of length 2n and we show that they provide the correlation function of the successive services in a busy period with n+ 1 customers. Résumé On s’intéresse à l’analyse des temps de service des clients d’une file M/M/1 stable et en équilibre selon leur position dans une période d’activité. On donne la loi d’un service sachant que le client se trouve au début, à la fin ou au milieu de la période d’activité. Ceci permet, au passage, de prouver que le processus des instants de début de service n’est pas un processus de Poisson. On mène ensuite une étude plus fine. On exhibe une famille de séries génératrices polynômiales associées aux chemins de Dyck de longueur 2n et on montre qu’il s’agit de la fonction de corrélation des différents services dans une période d’activité comportant n+ 1 clients.
منابع مشابه
Transient Solution of an M/M/1 Variant Working Vacation Queue with Balking
This paper presents the transient solution of a variant working vacation queue with balking. Customers arrive according to a Poisson process and decide to join the queue with probability $b$ or balk with $bar{b} = 1-b$. As soon as the system becomes empty, the server takes working vacation. The service times during regular busy period and working vacation period, and vacation times are assumed ...
متن کاملProbability Density for Number of Customers Served During the Busy Period of a Finite Auto-Correlated MEP/MEP/1 Queue or Probability Density for Services During the Busy Period of a Finite Auto-Correlated MEP/MEP/1 Queue
In this paper we study the sample paths during a busy period of a Finite MEP/MEP/1 system, where both the arrivals and service processes can be serially auto-correlated Matrix Exponential Processes and provide a mechanism to compute the expected number of customers served during a finite queue’s busy period. We then show some numeric results by computing the probabilities of serving exactly n c...
متن کاملWorking Vacation Queue with Second Optional Service and Unreliable Server
An M/M/1 queueing system with second optional service and unreliable server is studied. We consider that the server works at different rate rather than being idle during the vacation period. The customers arrive to the system according to Poisson process with state dependent rates depending upon the server’s status. All customers demand the first essential service whereas only some of them dema...
متن کاملM M m K Queue With Additional Servers and Discouragement (RESEARCH NOTE)
Waiting in long queue is undesirable due to which in some practical situations customers become impatient and leave the system. In such cases providing additional servers can reduce long queue. This investigation deals with multi-server queueing system with additional servers and discouragement. The customers arrive in poisson fashion and are served exponentially by a pool of permanent and addi...
متن کاملGlobal and local asymptotics for the busy period of an M/G/1 queue
We consider an M/G/1 queue with subexponential service times. We give a simple derivation of the global and local asymptotics for the busy period. This analysis relies on the explicit formula for the joint distribution for the number of customers and the length of the busy period of the M/G/1 queue. 2000 Mathematics Subject Classification: 60K25, 60G50, 60F10.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Queueing Syst.
دوره 49 شماره
صفحات -
تاریخ انتشار 2005